منابع مشابه
BIDA: An Improved Perimeter Search Algorithm
In this paper we present a new bidirectional heuristic search algorithm. Our algorithm can be viewed as a perimeter search algorithm, and it uses a new technique for reducing the number of heuristic evaluations. We also prove some general results on the behavior of iterative deepening perimeter search algorithms, and we discuss some new “lazy evaluation” techniques for improving their performan...
متن کاملOn The Perimeter of an Ellipse
Let E be the ellipse with major and minor radii a and b respectively, and Pbe its perimeter, then P = lim 4 tan(p/n)(a + b + 2) Σ a2 cos2 (2k-2)Pi/n+ sin2 (2k-2)Pi/n; where n = 2m. So without considering the limit, it gives a reasonable approxi-mation for P, it means that we can choose n large enough such that the amountof error be less than any given small number. On the other hand, the form...
متن کاملImproved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for building ε-nets of size O ( 1 ε log log 1 ε ) for the instances of Hitting Set associated with our guarding problem. We then apply the technique of Brönnimann and Goodrich to build an approximation algorithm from this ε-n...
متن کاملAn Improved Trusted Greedy Perimeter Stateless Routing for Wireless Sensor Networks
In this paper, an improvement over Trusted Greedy Perimeter Stateless Routing (T-GPSR) is presented. T-GPSR employs heuristic weight values to evaluate total trust value of neighboring nodes. However, heuristic assignment of weights provide flexibility but it is not suitable in presence of several security attacks such as Grey hole, selfish behavior, on-off attack etc., are launched in the netw...
متن کاملVertical perimeter versus horizontal perimeter
Given k ∈ N, the k’th discrete Heisenberg group, denoted H Z , is the group generated by the elements a1, b1, . . . , ak, bk, c, subject to the commutator relations [a1, b1] = . . . = [ak, bk] = c, while all the other pairs of elements from this generating set are required to commute, i.e., for every distinct i, j ∈ {1, . . . , k} we have [ai, aj ] = [bi, bj ] = [ai, bj ] = [ai, c] = [bi, c] = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Lancet
سال: 1872
ISSN: 0140-6736
DOI: 10.1016/s0140-6736(02)51928-0